Stochastic Search in a Forest Revisited

نویسندگان

  • Jay Sethuraman
  • John N. Tsitsiklis
چکیده

We consider a generalization of the model of stochastic search in an out-forest, introduced and studied by Denardo, Rothblum, and Van der Heyden [1]. We provide a simple proof of the optimality of index-based policies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry

We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...

متن کامل

Decision making in forest management with consideration of stochastic prices

  The optimal harvesting policy is calculated as a function of the entering stock, the price state, the harvesting cost, and the rate of interest in the capital market. In order to determine the optimal harvest schedule, the growth function and stumpage price process are estimated for the Swedish mixed species forests. The stumpage price is assumed to follow a stochastic Markov process. A stoch...

متن کامل

Market Adaptive Control Function Optimization in Continuous Cover Forest Management

Economically optimal management of a continuous cover forest is considered here. Initially, there is a large number of trees of different sizes and the forest may contain several species. We want to optimize the harvest decisions over time, using continuous cover forestry, which is denoted by CCF. We maximize our objective function, the expected present value, with consideration of stochastic p...

متن کامل

Scheduling and Stochastic Capacity Estimation of an EV Charging Station with PV Rooftop Using Queuing Theory and Random Forest

Power capacity of EV charging stations could be increased by installing PV arrays on their rooftops. In these charging stations, power transmission can be two-sided when needed. In this paper a new method based on queuing theory and random forest algorithm proposed to calculate net power of charging station considering random SOC of EV’s. Due to estimation time constraints, a queuing model with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2007